全文获取类型
收费全文 | 961篇 |
免费 | 136篇 |
国内免费 | 92篇 |
专业分类
化学 | 243篇 |
晶体学 | 6篇 |
力学 | 35篇 |
综合类 | 32篇 |
数学 | 559篇 |
物理学 | 314篇 |
出版年
2024年 | 1篇 |
2023年 | 6篇 |
2022年 | 13篇 |
2021年 | 20篇 |
2020年 | 18篇 |
2019年 | 20篇 |
2018年 | 25篇 |
2017年 | 32篇 |
2016年 | 36篇 |
2015年 | 25篇 |
2014年 | 55篇 |
2013年 | 64篇 |
2012年 | 56篇 |
2011年 | 39篇 |
2010年 | 45篇 |
2009年 | 52篇 |
2008年 | 61篇 |
2007年 | 53篇 |
2006年 | 80篇 |
2005年 | 41篇 |
2004年 | 46篇 |
2003年 | 59篇 |
2002年 | 39篇 |
2001年 | 42篇 |
2000年 | 53篇 |
1999年 | 31篇 |
1998年 | 42篇 |
1997年 | 19篇 |
1996年 | 21篇 |
1995年 | 12篇 |
1994年 | 18篇 |
1993年 | 9篇 |
1992年 | 4篇 |
1991年 | 10篇 |
1990年 | 6篇 |
1989年 | 1篇 |
1988年 | 4篇 |
1987年 | 1篇 |
1985年 | 7篇 |
1984年 | 4篇 |
1983年 | 1篇 |
1982年 | 4篇 |
1981年 | 2篇 |
1980年 | 4篇 |
1979年 | 5篇 |
1978年 | 2篇 |
1977年 | 1篇 |
排序方式: 共有1189条查询结果,搜索用时 760 毫秒
81.
In this paper, a graphical characterization, in the decision space, of the properly efficient solutions of a convex multiobjective
problem is derived. This characterization takes into account the relative position of the gradients of the objective functions
and the active constraints at the given feasible solution. The unconstrained case with two objective functions and with any
number of functions and the general constrained case are studied separately. In some cases, these results can provide a visualization
of the efficient set, for problems with two or three variables. Besides, a proper efficiency test for general convex multiobjective
problems is derived, which consists of solving a single linear optimization problem. 相似文献
82.
We study the contractibility of the efficient solution set of strictly quasiconcave vector maximization problems on (possibly) noncompact feasible domains. It is proved that the efficient solution set is contractible if at least one of the objective functions is strongly quasiconcave and any intersection of level sets of the objective functions is a compact (possibly empty) set. This theorem generalizes the main result of Benoist (Ref.1), which was established for problems on compact feasible domains.The authors thank Dr. T. D. Phuong, Dr. T. X. D. Ha, and the referees for helpful comments and suggestions. 相似文献
83.
王刚 《应用数学与计算数学学报》2007,21(2):27-34
本文研究是线性的双层多目标决策.根据线性规划的对偶理论证明了双层多目标决策的可行集的连通性;利用s*-最优均衡解的概念,求得双层多目标规划的偏好满意解;最后,我们得到了满意解的有效性,并在极点得到. 相似文献
84.
The present paper is a continuation of [2] where we deal with the duality for a multiobjective fractional optimization problem. The basic idea in [2] consists in attaching an intermediate multiobjective convex optimization problem to the primal fractional problem, using
an approach due to Dinkelbach ([6]), for which we construct then a dual problem expressed in terms of the conjugates of the functions involved. The weak, strong
and converse duality statements for the intermediate problems allow us to give dual characterizations for the efficient solutions
of the initial fractional problem. The aim of this paper is to compare the intermediate dual problem with other similar dual
problems known from the literature. We completely establish the inclusion relations between the image sets of the duals as
well as between the sets of maximal elements of the image sets.
相似文献
85.
在Banach空间中,给出了含参数的单值映射的不变类凸,拟不变类凸和伪不变类凸的概念.在这类较弱凸性条件下,提出了参数优化问题弱有效解的几个最优性充分条件.作为应用,研究了一类状态约束最优控制问题的弱最优控制. 相似文献
86.
X. H. Gong 《Journal of Optimization Theory and Applications》1994,83(1):83-96
In vector optimization, the topological properties of the set of efficient solutions are of interest. Several authors have studied this topic for point-valued functions. In this paper, we study the connectedness of the efficient solution sets in convex vector optimization for set-valued maps in normed spaces.The author would like to thank Professor W. T. Fu for helpful discussions concerning Theorem 3.1 and other valuable comments. Moreover, the author is grateful to Professor H. P. Benson and three referees for valuable remarks and suggestions concerning a previous draft of this paper. 相似文献
87.
Constraint qualifications in multiobjective optimization problems: Differentiable case 总被引:7,自引:0,他引:7
T. Maeda 《Journal of Optimization Theory and Applications》1994,80(3):483-500
In this paper, we are concerned with a multiobjective optimization problem with inequality constraints. We introduce a constraint qualification and derive the Kuhn-Tucker type necessary conditions for efficiency. Moreover, we give conditions which ensure the constraint qualification.This work was done while the author was visiting the University of California, Berkeley, California. 相似文献
88.
89.
90.
Let (P) denote the vector maximization problem
where the objective functions f
i
are strictly quasiconcave and continuous on the feasible domain D, which is a closed and convex subset of R
n
. We prove that if the efficient solution set E(P) of (P) is closed, disconnected, and it has finitely many (connected) components, then all the components are unbounded. A similar fact is also valid for the weakly efficient solution set E
w
(P) of (P). Especially, if f
i
(i=1,...,m) are linear fractional functions and D is a polyhedral convex set, then each component of E
w
(P) must be unbounded whenever E
w
(P) is disconnected. From the results and a result of Choo and Atkins [J. Optim. Theory Appl. 36, 203–220 (1982.)] it follows that the number of components in the efficient solution set of a bicriteria linear fractional vector optimization problem cannot exceed the number of unbounded pseudo-faces of D. 相似文献